Characterizing the hierarchical Hough transform through a polygonal approximation algorithm
نویسندگان
چکیده
We propose to study the relationship between the hierachical Hough transform and classical algorithms for partitioning curves into segments. We show that the set of segments found by classical algorithms is a subset of the segments found by the hierarchical Hough transform. This new relationship allows to have a better understanding of the behaviour of some parameters of the hierarchical Hough transform.
منابع مشابه
A Fast Decision Technique for Hierarchical Hough Transform for Line Detection
Many techniques have been proposed to speedup the performance of classic Hough Transform. These techniques are primarily based on converting the voting procedure to a hierarchy based voting method. These methods use approximate decision-making process. In this paper, we propose a fast decision making process that enhances the speed and reduces the space requirements. Experimental results demons...
متن کاملUnsupervised Clustering in Hough Space for Identification of Partially Occluded Objects
ÐAn automated approach for template-free identification of partially occluded objects is presented. The contour of each relevant object in the analyzed scene is modeled with an approximating polygon whose edges are then projected into the Hough space. A structurally adaptive self-organizing map neural network generates clusters of collinear and/or parallel edges, which are used as the basis for...
متن کاملA Hierarchical Hough Transform for Fingerprint Matching
This paper addresses the improvement on the generalized Hough transform for the biometric identification applications. The errors in generalized Hough transform for fingerprint matching are investigated and a new hierarchical Hough transform algorithm is proposed, which is faster and more accurate compared to conventional generalized Hough transform.
متن کاملIris localization by means of adaptive thresholding and Circular Hough Transform
In this paper, a new iris localization method for mobile devices is presented. Our system uses both intensity and saturation threshold on the captured eye images to determine iris boundary and sclera area, respectively. Estimated iris boundary pixels which have been placed outside the sclera will be removed. The remaining pixels are mainly the boundary of iris inside the sclera. Then, circular ...
متن کاملIDIAP Finding Lines under Bounded
A new algorithm for nding lines in images under a bounded error noise model is described. The algorithm is based on a hierarchical and adaptive subdivision of the space of line parameters, but, unlike previous adaptive or hierarchical line nders based on the Hough transform, measures errors in image space and thereby guarantees that no solution satisfying the given error bounds will be lost. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 16 شماره
صفحات -
تاریخ انتشار 1995